Dynamic Scheduling, Allocation, and Compaction Scheme for Real-time Tasks on Fpgas
نویسندگان
چکیده
ii ACKNOWLEDGEMENTS I would like to express my heartfelt gratitude to Dr. Jerry L. Trahan for giving me his valuable guidance and insight during the course of this research work. I also acknowledge and appreciate the help rendered by Drs. Vaidyanathan Ramachandran, and Subhash C. Kak during the course of my graduate study. Thanks are also due to Dr. Susan Welsh of The Coastal Studies Institute for her constant support, encouragement and for also providing me with a graduate research assistantship. I would also like to thank my parents and my sister for their moral and academic support through all my academic endeavors. Finally, I would also like to thank all the graduate students of The Department of Electrical and Computer Engineering for making my stay in Baton Rouge a pleasant one.
منابع مشابه
Dynamic Scheduling and Allocation in Two-Dimensional Mesh-Connected Multicomputers for Real-Time Tasks∗
Among several multiprocessor topologies, twodimensional (2D) mesh topology has become popular due to its simplicity and efficiency. Even though a number of scheduling and processor allocation schemes for 2D meshes have been proposed in the literature, little study has been done aimed for realtime environment. In this paper, we propose an on-line scheduling and allocation scheme for real-time ta...
متن کاملQuay Cranes and Yard Trucks Scheduling Problem at Container Terminals
A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...
متن کاملDynamic Scheduling of Tasks on Partially Recon gurable FPGAs
Field Programmable Gate Arrays FPGAs that allow partial recon guration at run time can be shared among multiple independent tasks When the sequence of tasks to be performed is unpredictable the FPGA controller needs to make allocation decisions on line Since on line allocation su ers from fragmentation tasks can end up waiting despite there being su cient albeit non contiguous resources availab...
متن کاملOn Scheduling Dynamic FPGA Recon gurations
The ability to partially recon gure dynamically recon g urable Field Programmable Gate Arrays FPGAs at run time allows them to be shared among multiple independent tasks When the se quence of tasks to be performed is unpredictable the FPGA controller needs to make allocation decisions on line Since on line allocation suf fers from fragmentation tasks can end up waiting despite there being su ci...
متن کاملMultiprocessor Environment Using Genetic Algorithm
Task Scheduling [1] is the allocation of resources over time to perform a collection of tasks. Real -time systems make use of scheduling algorithms to maximize the number of real -time tasks that can be processed without violating timing constraints. A scheduling algorithm provides a schedule for a task set that assigns tasks to processors and provides an ordered list of tasks. The schedule is ...
متن کامل